package org.example;

import org.example.GC.BFS;
import org.example.GC.MyCircularQueue;
import org.example.GC.Stacks;
import org.example.GC.lands;

import java.util.HashSet;
import java.util.Map;
import java.util.Set;

/**
 * Hello world!
 *
 */
public class App
{
    public static void main( String[] args )
    {
//        MyCircularQueue nums = new MyCircularQueue(3);
//        System.out.println(nums.enQueue(1));
//        System.out.println(nums.enQueue(2));
//        System.out.println(nums.enQueue(3));
//        System.out.println(nums.enQueue(4));
//        System.out.println(nums.Rear());
//        nums.isFull();
//        nums.deQueue();
//        nums.enQueue(4);
//        System.out.println(nums.Rear());

//        String[] dead = {"0201", "0101", "0102", "1212", "2002"};
//        String target = "0202";
//        BFS bfs = new BFS();
//        int i = bfs.openLock(dead, target);
//        System.out.println(i);
//
//        Integer i = 54;
//        int i1 = bfs.numSquares(i);
//        System.out.println(i1);

//        Stacks stacks = new Stacks();
//        String s = "{}";
//        boolean valid = stacks.isValid(s);
//        System.out.println(valid);

        lands land = new lands();
        int[] nums ={1,1,1};
        int i = land.pivotIndex(nums);
        System.out.println(i);
    }

}
